MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS
نویسندگان
چکیده
Meet semidistributive varieties are in a sense the last of most important classes universal algebra for which it is unknown whether can be characterized by strong Maltsev condition. We present new, relatively simple condition characterizing meet-semidistributive varieties, and provide candidate
منابع مشابه
Congruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملA Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a nite language is congruence meet-semidistributive and residually less than some nite cardinal, then it is nitely based. Theorem B: there is an algorithm which, given m < ! and a nite algebra in a nite language, determines whether the variety generated by the a...
متن کاملAlgorithms for k-meet-semidistributive lattices
In this paper we consider k-meet-semidistributive lattices and we are interested in the computation of the set-colored poset associated to an implicational base. The parameter k is of interest since for any nite lattice L there exists an integer k for which L is k-meetsemidistributive. When k = 1 they are known as meet-semidistributive lattices. We rst give a polynomial time algorithm to comput...
متن کاملResidually Finite, Congruence Meet-semidistributive Varieties of Finite Type Have a Finite Residual Bound
We show that a residually finite, congruence meet-semidistributive variety of finite type is residually < N for some finite N . This solves Pixley’s problem and a special case of the restricted Quackenbush problem.
متن کاملDeciding some Maltsev conditions in finite idempotent algebras
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a certain type of existential condition on its set of term operations. These conditions, known as Maltsev conditions, have played a central role in the classification, study, and applications of general algebraic structures. Several well studied properties of equationally define...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2021
ISSN: ['1943-5886', '0022-4812']
DOI: https://doi.org/10.1017/jsl.2021.14